Global Search in Combinatorial Optimization using Reinforcement Learning Algorithms
نویسنده
چکیده
This paper presents two approaches that address the problems of the local character of the search and imprecise state representation of reinforcement learning (RL) algorithms for solving combinatorial optimization problems. The first, Bayesian, approach aims to capture solution parameter interdependencies. The second approach combines local information as encoded by typical RL schemes and global information as contained in a population of search agents. The effectiveness of these approaches is demonstrated on the Quadratic Assignment Problem (QAP). Competitive results with the RL-agent approach suggest that it can be used as a basis for global optimization techniques.
منابع مشابه
An Approach to Solving Combinatorial Optimization Problems Using a Population of Reinforcement Learning Agents
This paper presents an approach that uses reinforcement learning (RL) algorithms to solve combinatorial optimization problems. In particular, the approach combines both local and global search characteristics: local information as encoded by typical RL schemes and global information as contained in a population of search agents. The effectiveness of the approach is demonstrated on both the Asym...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA Survey on Reinforcement Learning in Global Optimization
This report surveys recent development on the global combinatorial optimization using reinforcement learning methods. It introduces the general background of combinatorial optimization problems and reinforcement learning techniques, describes observations and previous works in this area, and focuses on Boyan and Moore's recent work, the STAGE algorithm with the assistant of reinforcement learning.
متن کاملLearning Evaluation Functions
Evaluation functions are an essential component of practical search algorithms for optimization, planning and control. Examples of such algorithms include hillclimb-ing, simulated annealing, best-rst search, A*, and alpha-beta. In all of these, the evaluation functions are typically built manually by domain experts, and may require considerable tweaking to work well. I will investigate the thes...
متن کاملReinforcement Learning and Local Search: A Case Study
We describe a reinforcement learning-based variation to the combinatorial optimization technique known as local search. The hillclimbing aspect of local search uses the problem's primary cost function to guide search via local neighborhoods to high quality solutions. In complicated optimization problems, however, other problem characteristics can also help guide the search process. In this repo...
متن کامل